Flow Network-Based Real-Time Scheduling for Reducing Static Energy Consumption on Multiprocessors

Soft Real-Time Scheduling on Multiprocessors

UMAMAHESWARI C. DEVI: Soft Real-Time Scheduling on Multiprocessors. (Under the direction of Prof. James H. Anderson.) The design of real-time systems is being impacted by two trends. First, tightly-coupled multiprocessor platforms are becoming quite common. This is evidenced by the availability of affordable symmetric shared-memory multiprocessors and the emergence of multicore architectures. S...

Static-priority Scheduling on Multiprocessors

This thesis deals with the problem of scheduling a set of tasks to meet deadlines on a computer with multiple processors. Static-priority scheduling is considered, that is, a task is assigned a priority number that never changes and at every moment the highestpriority tasks that request to be executed are selected for execution. The performance metric used is the capacity that tasks can request...

T-L plane-based real-time scheduling for homogeneous multiprocessors

We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. We introduce a novel abstraction for reasoning about task execution behavior on multiprocessors, called T-L plane and present T-L plane-based real-time scheduling algorithms. We show that ...

On-line scheduling of hard real-time tasks on multiprocessors

On-line real-time task scheduling on partitionable multiprocessors

Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention than before. However , until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. In this paper, we propose a new on-line scheduling algorithm , called Deferred Earliest...